Polynomial kernels for deletion to classes of acyclic digraphs
نویسندگان
چکیده
منابع مشابه
Polynomial Kernels for Deletion to Classes of Acyclic Digraphs
We consider the problem to find a set X of vertices (or arcs) with |X| ≤ k in a given digraph G such that D = G − X is an acyclic digraph. In its generality, this is Directed Feedback Vertex Set or Directed Feedback Arc Set respectively. The existence of a polynomial kernel for these problems is a notorious open problem in the field of kernelization, and little progress has been made. In this p...
متن کاملKernels for Deletion to Classes of Acyclic Digraphs
In the Directed Feedback Vertex Set (DFVS) problem, we are given a digraph D on n vertices and a positive integer k and the objective is to check whether there exists a set of vertices S of size at most k such that F = D−S is a directed acyclic digraph. In a recent paper, Mnich and van Leeuwen [STACS 2016 ] considered the kernelization complexity of DFVS with an additional restriction on F , na...
متن کاملSubpath acyclic digraphs
A characterization is given for acyclic digraphs that are the acyclic intersection digraphs of subpaths of a directed tree.
متن کاملDown-coloring acyclic digraphs
We consider vertex coloring of an acyclic digraph ~ G in such a way that two vertices which have a common ancestor in ~ G receive distinct colors. Such colorings arise in a natural way when bounding space for various genetic data for efficient analysis. We discuss the corresponding chromatic number and derive an upper bound as a function of the maximum number of descendants of a given vertex an...
متن کاملPolynomial Kernels and Wideness Properties of Nowhere Dense Graph Classes
Nowhere dense classes of graphs [21, 22] are very general classes of uniformly sparse graphs with several seemingly unrelated characterisations. From an algorithmic perspective, a characterisation of these classes in terms of uniform quasi-wideness, a concept originating in finite model theory, has proved to be particularly useful. Uniform quasi-wideness is used in many fpt-algorithms on nowher...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2017
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2017.02.002